Efficient Implementation of PRESENT and GIFT on Quantum Computers

Grover search algorithm is the most representative quantum attack method that threatens security of symmetric key cryptography. If applied to cryptography, level target cryptography can be lowered from n-bit n2-bit. When applying Grover’s block cipher potential attacks, must implemented as circuits. Starting with AES cipher, a number works have been conducted optimize and implement ciphers into Recently, many studies published lightweight In this paper, we present optimal circuit designs including PRESENT GIFT ciphers. The proposed optimized by minimizing qubits, gates, depth. We compare circuits other results implementations in Finally, resources required for oracle were estimated.